Solving nonconvex planar location problems by nite dominating sets

It is well-known that some of the classical location problems with polyhedral gauges can be solved in polynomial time by nding a fi nite dominating set, i.e. a finite set of candidates guaranteed to contain at least one optimal location. In this paper it is fi rst established that this result holds for a much larger class of problems than currently considered in the literature. The model for which this result can be proven includes, for instance, location problems with attraction and repulsion, and location-allocation problems. Next, it is shown that the approximation of general gauges by polyhedral ones in the objective function of our general model can be analyzed with regard to the subsequent error in the optimal ob jective value. For the approximation problem two di erent approaches are described, the sandwich procedure and the greedy algorithm. Both of these approaches lead - for fixed e - to polynomial approximation algorithms with accuracy for solving the general model considered in this paper.Dirección General de Enseñanza Superio

Rolleneinstellungen, Einstellungen zum Wert von Kindern und die eheliche Zufriedenheit beim Übergang zur Elternschaft in Korea: eine Fragebogenuntersuchung zur Bedeutung von Einstellungsvariablen für die Familienentwicklung

Die Autoren präsentieren im folgenden Beitrag die Ergebnisse einer Fragebogenuntersuchung an werdenden Erst- und Zweiteltern aus der Republik Korea. Belegmaterial wurde gefunden für eine Verschlechterung der ehelichen Zufriedenheit in den frühen Jahren der Elternschaft sowie Unterschiede zwischen Erst- und Zweiteltern in der Einschätzung des Wertes von Kindern. (TL2

Practical guidelines for rigor and reproducibility in preclinical and clinical studies on cardioprotection

The potential for ischemic preconditioning to reduce infarct size was first recognized more than 30 years ago. Despite extension of the concept to ischemic postconditioning and remote ischemic conditioning and literally thousands of experimental studies in various species and models which identified a multitude of signaling steps, so far there is only a single and very recent study, which has unequivocally translated cardioprotection to improved clinical outcome as the primary endpoint in patients. Many potential reasons for this disappointing lack of clinical translation of cardioprotection have been proposed, including lack of rigor and reproducibility in preclinical studies, and poor design and conduct of clinical trials. There is, however, universal agreement that robust preclinical data are a mandatory prerequisite to initiate a meaningful clinical trial. In this context, it is disconcerting that the CAESAR consortium (Consortium for preclinicAl assESsment of cARdioprotective therapies) in a highly standardized multi-center approach of preclinical studies identified only ischemic preconditioning, but not nitrite or sildenafil, when given as adjunct to reperfusion, to reduce infarct size. However, ischemic preconditioning—due to its very nature—can only be used in elective interventions, and not in acute myocardial infarction. Therefore, better strategies to identify robust and reproducible strategies of cardioprotection, which can subsequently be tested in clinical trials must be developed. We refer to the recent guidelines for experimental models of myocardial ischemia and infarction, and aim to provide now practical guidelines to ensure rigor and reproducibility in preclinical and clinical studies on cardioprotection. In line with the above guideline, we define rigor as standardized state-of-the-art design, conduct and reporting of a study, which is then a prerequisite for reproducibility, i.e. replication of results by another laboratory when performing exactly the same experiment

Solving nonconvex planar location problems by finite dominating sets

It is well-known that some of the classical location problems with polyhedral gauges can be solved in polynomial time by finding a finite dominating set, i.e. a finite set of candidates guaranteed to contain at least one optimal location. In this paper it is first established that this result holds for a much larger class of problems than currently considered in the literature. The model for which this result can be proven includes, for instance, location problems with attraction and repulsion, and location-allocation problems. Next, it is shown that the approximation of general gauges by polyhedral ones in the objective function of our general model can be analyzed with regard to the subsequent error in the optimal objective value. For the approximation problem two different approaches are described, the sandwich procedure and the greedy algorithm. Both of these approaches lead - for fixed epsilon - to polynomial approximation algorithms with accuracy epsilon for solving the general model considered in this paper